Improving the Bin Packing Heuristic through Grammatical Evolution Based on Swarm Intelligence
نویسندگان
چکیده
منابع مشابه
A Hyper-Heuristic Classifier for One Dimensional Bin Packing Problems: Improving Classification Accuracy by Attribute Evolution
A hyper-heuristic for the one dimensional bin packing problem is presented that uses an Evolutionary Algorithm (EA) to evolve a set of attributes that characterise a problem instance. The EA evolves divisions of variable quantity and dimension that represent ranges of a bin’s capacity and are used to train a k-nearest neighbour algorithm. Once trained the classifier selects a single determinist...
متن کاملFrequency Distribution Based Hyper-Heuristic for the Bin-Packing Problem
In the paper, we investigate the pair frequency of low-level heuristics for the bin packing problem and propose a Frequency Distribution based Hyper-Heuristic (FDHH). FDHH generates the heuristic sequences based on a pair of low-level heuristics rather than an individual low-level heuristic. An existing Simulated Annealing Hyper-Heuristic (SAHH) is employed to form the pair frequencies and is e...
متن کاملA Self Organizing Bin Packing Heuristic
This paper reports on experiments with a new on-line heuris-tic for one-dimensional bin packing whose average-case behavior is surprisingly robust. We restrict attention to the class of \discrete" distributions , i.e., ones in which the set of possible item sizes is nite (as is commonly the case in practical applications), and in which all sizes and probabilities are rational. It is known from ...
متن کاملA Set-Covering-Based Heuristic Approach for Bin-Packing Problems
Several combinatorial optimization problems can be formulated as large size SetCovering Problems. In this work, we use the Set-Covering formulation to obtain a general heuristic algorithm for this type of problems, and describe our implementation of the algorithm for solving two variants of the well-known (One-Dimensional) Bin Packing Problem: the Two-Constraint Bin Packing Problem and the basi...
متن کاملA Heuristic for Improved Genetic Bin Packing
The bin packing optimization problem packs a set of objects into a set of bins so that the amount of wasted space is minimized The bin packing problem has many important applications These include multiprocessor scheduling resource allocation and real world planning packing routing and scheduling optimization problems The bin packing problem is NP complete Since there is therefore little hope i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2014
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2014/545191